Heavy-Traffic Limits for Loss Proportions in Single-Server Queues

نویسنده

  • Ward Whitt
چکیده

We establish heavy-traffic stochastic-process limits for the queue-length and overflow stochastic processes in the standard single-server queue with finite waiting room (G/G/1/K). We show that, under regularity conditions, the content and overflow processes in related single-server models with finite waiting room, such as the finite dam, satisfy the same heavy-traffic stochastic-process limits. As a consequence, we obtain heavy-traffic limits for the proportion of customers or input lost over an initial interval. Except for an interchange of the order of two limits, we thus obtain heavy-traffic limits for the steady-state loss proportions. We justify the interchange of limits in M/GI/1/K and GI/M/1/K special cases of the standard GI/GI/1/K model by directly establishing local heavy-traffic limits for the steady-state blocking probabilities.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Nonsymmetric Longer Queue Model: Joint Distribution, Asymptotic Properties, and Heavy Traffic Limits

We consider two parallel queues, each with independent Poisson arrival rates, that are tended by a single server. The exponential server devotes all of its capacity to the longer of the queues. If both queues are of equal length, the server devotes ] of its capacity to the first queue and the remaining 1 − ] to the second. We obtain exact integral representations for the joint probability distr...

متن کامل

A New View of the Heavy-Traffic Limit Theorem for Infinite-Server Queues

This paper presents a new approach for obtaining heavy-traffic limits for infinite-server queues and open networks of infinite-server queues. The key observation is that infinite-server queues having deterministic service times can easily be analyzed in terms of the arrival counting process. A variant of the same idea applies when the service times take values in a finite set, so this is the ke...

متن کامل

Time-Varying Queues

Service systems abound with queues, but the most natural direct models are often timevarying queues, which require nonstandard analysis methods beyond stochastic textbooks. This paper surveys the literature on time-varying queues. Most of the literature concerns manyserver queues, which arise in large-scale service systems, such as in customer contact centers and hospital emergency departments,...

متن کامل

Heavy Traffic Limits for Unobservable Queues with Clearing Times

In many service systems, customers may choose to abandon the system if their wait is deemed excessive. In an observable queue, the server is always aware that an abandoning customer has left the queue. However, in unobservable queues, the fact that the customer has abandoned the system may be unbeknownst to the server. Not only are the abandoning customers unobservable to the server, the server...

متن کامل

Limits and Approximations for the Busy-period Distribution in Single-server Queues

Limit theorems are established and relatively simple closed-form approximations are developed for the busy-period distribution in single-server queues. For the M/G/1 queue, the complementary busy-period cdf is shown to be asymptotically equivalent as t → ∞ to a scaled version of the heavy-traffic limit (obtained as ρ → 1), where the scaling parameters are based on the asymptotics as t → ∞. We c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Queueing Syst.

دوره 46  شماره 

صفحات  -

تاریخ انتشار 2004